Valid inequalities for the multi-dimensional multiple-choice 0–1 knapsack problem
نویسندگان
چکیده
منابع مشابه
APPROXIMATE ALGORITHM FOR THE MULTI-DIMENSIONAL KNAPSACK PROBLEM BY USING MULTIPLE CRITERIA DECISION MAKING
In this paper, an interesting and easy method to solve the multi-dimensional knapsack problem is presented. Although it belongs to the combinatorial optimization, but the proposed method belongs to the decision making field in mathematics. In order to, initially efficiency values for every item is calculated then items are ranked by using Multiple Criteria Decision Making (MCDA). Finally, ite...
متن کاملLifting valid inequalities for the precedence constrained knapsack problem
This paper considers the precedence constrained knapsack problem. More speci cally, we are interested in classes of valid inequalities which are facet-de ning for the precedence constrained knapsack polytope. We study the complexity of obtaining these facets using the standard sequential lifting procedure. Applying this procedure requires solving a combinatorial problem. For valid inequalities ...
متن کاملThe Multiple-choice Knapsack Problem
This paper treats the multiple-choice (continuous) knapsack problem P: n mi n mi maximize L .L cijxijsubjectto(l) I I aij x ij";b,(2)0,,;xij";1,i=I,2, i=l J=l i=l J=1 ... , n, j = 1,2, .... mi and (3) at most one of x il, x i2' ... , x im. is positive for i = 1,2, ., ., n, , where n, mi are positive integers and aij' Cij' bare nonnegative real numbers. Two approximate algorithms and an exact br...
متن کاملA Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem
In this paper, we approximately solve the multiple-choice multi-dimensional knapsack problem. We propose an algorithm which is based upon reactive local search and where an explicit check for the repetition of configurations is added to the local search. The algorithm starts by an initial solution and improved by using a fast iterative procedure. Later, both deblocking and degrading procedures ...
متن کاملA New Hybrid Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem
In this paper, we approximately solve the multiple-choice multi-dimensional knapsack problem. We propose a hybrid algorithm based on branch and bound method and Pareto-algebraic operations. The algorithm starts by an initial solution and then combines one-by-one groups of the problem instance to generate partial solutions in each iteration. Most of these partial solutions are discarded by Paret...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2015
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2015.03.003